Towards a Taxonomy of Parallel Branch and Bound Algorithms

نویسندگان

  • Harry W.J.M. Trienekens
  • Arie de Bruin
چکیده

In this paper we present a classification of parallel branch and bound algorithms, and elaborate on the consequences of particular parameter settings. The taxonomy is based upon how the algorithms handle the knowledge about the problem instance to be solved, generated during execution. The starting point of the taxonomy is the generally accepted description of the sequential branch and bound algorithm, as presented in, for example, [Mitten 1970] and [Ibaraki 1976a, 1976b, 1977a, 1977b]. 1980 Mathematical Subject Classification: 90C27, 68Q10, 68R05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

متن کامل

Towards an abstract parallel branch and bound machine

Many (parallel) branch and bound algorithms look very different from each other at first glance. They exploit, however, the same underlying computational model. This phenomenon can be used to define branch and bound algorithms in terms of a set of basic rules that are applied in a specific (predefined) order. In the sequential case, the specification of Mitten’s rules turns out to be sufficient...

متن کامل

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

متن کامل

Exact algorithms for solving a bi-level location–allocation problem considering customer preferences

The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...

متن کامل

A Novel Comprehensive Taxonomy of Intelligent-Based Routing Protocols in Wireless Sensor Networks

Routing in ad-hoc networks, specifically intelligent-based ones, is a highly interested research topic in recent years. Most of them are simulation-based study. Large percentages have not even mentioned some of the fundamental parameters. This strictly reduces their validity and reliability. On the other hand, there is not a comprehensive framework to classify routing algorithms in wireless sen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992